Labelled Lambda-calculi with Explicit Copy and Erase
نویسندگان
چکیده
We present two rewriting systems that define labelled explicit substitution λ -calculi. Our work is motivated by the close correspondence between Lévy’s labelled λ -calculus and paths in proof-nets, which played an important role in the understanding of the Geometry of Interaction. The structure of the labels in Lévy’s labelled λ -calculus relates to the multiplicative information of paths; the novelty of our work is that we design labelled explicit substitution calculi that also keep track of exponential information present in call-by-value and call-by-name translations of the λ -calculus into linear logic proof-nets.
منابع مشابه
A journey through resource control lambda calculi and explicit substitution using intersection types
In this paper we invite the reader to a journey through three lambda calculi with resource control: the lambda calculus, the sequent lambda calculus, and the lambda calculus with explicit substitution. All three calculi enable explicit control of resources due to the presence of weakening and contraction operators. Along this journey, we propose intersection type assignment systems for all thre...
متن کاملA journey through resource control lambda calculi and explicit substitution using intersection types (an account)
In this paper we invite the reader to a journey through three lambda calculi with resource control: the lambda calculus, the sequent lambda calculus, and the lambda calculus with explicit substitution. All three calculi enable explicit control of resources due to the presence of weakening and contraction operators. Along this journey, we propose intersection type assignment systems for all thre...
متن کاملA Compositional Coalgebraic Model of a Fragment of Fusion Calculus
This work is a further step in exploring the labelled transitions and bisimulations of fusion calculi. We follow the approach developed by Turi and Plotkin for lifting transition systems with a syntactic structure to bialgebras and, thus, we provide a compositional model of the fusion calculus with explicit fusions. In such a model, the bisimilarity relation induced by the unique morphism to th...
متن کاملCharacterising Explicit Substitutions whichPreserve
Contrary to all expectations, the-calculus, the canonical simply-typed lambda-calculus with explicit substitutions, is not strongly normalising. This result has led to a proliferation of calculi with explicit substitutions. This paper shows that the reducibility method provides a general criterion when a calculus of explicit substitution is strongly normalising for all untyped lambda-terms that...
متن کامل